The communicability distance in graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The communicability distance in graphs

Article history: Received 12 January 2012 Accepted 24 January 2012 Available online 25 February 2012 Submitted by R. Brualdi AMS classification: 05C12 05C50 15A18 15A16

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

Remarks on Distance-Balanced Graphs

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

متن کامل

Predicting triadic closure in networks using communicability distance functions

We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated on the basis of communicability distance functions that account for the “goodness” of communication between nodes in the network. We study 25 real-world networks and show that the proposed method predicts correctly 20% of triadic closures in these networks, in contrast...

متن کامل

Hyperspherical embedding of graphs and networks in communicability spaces

Let G be a simple connected graph with n nodes and let fαk (A) be a communicability function of the adjacency matrix A, which is expressible by the following Taylor series expansion:  ∞ k=0 αkA k. We prove here that if fαk (A) is positive semidefinite then the function ηp,q = (fαk (A)pp+ fαk (A)qq−2fαk (A)pq) 1 2 is a Euclidean distance between the corresponding nodes of the graph. Then, we pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2012

ISSN: 0024-3795

DOI: 10.1016/j.laa.2012.01.017